The Kontsevich tetrahedral flow revisited
نویسندگان
چکیده
منابع مشابه
The Kontsevich Integral And
Given a finite dimensional representation of a semisimple Lie algebra there are two ways of constructing link invariants: 1) quantum group invariants using the R-matrix, 2) the Kontsevich universal link invariant followed by the Lie algebra based weight system. Le and Murakami showed that these two link invariants are the same. These constructions can be generalized to some classes of Lie super...
متن کاملPre-integrated Flow Illustration for Tetrahedral Meshes
Previous work has demonstrated the clarity and usefulness of illustrative techniques for visualizing flow data. However, previous systems were limited to applying these techniques to uniform grids. Since unstructured grids have emerged as a common basis for computing flow simulations, we present a method to apply and extend the flow illustration approach to tetrahedral meshes using pre-integrat...
متن کاملThe multiroute maximum flow problem revisited
We are given a directed network G = (V,A, u) with vertex set V , arc set A, a source vertex s ∈ V , a destination vertex t ∈ V , a finite capacity vector u = {uij}ij∈A, and a positive integer m ∈ Z+. The multiroute maximum flow problem (m-MFP) generalizes the ordinary maximum flow problem by seeking a maximum flow from s to t subject to not only the regular flow conservation constraints at the ...
متن کاملthe effects of changing roughness on the flow structure in the bends
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
Iterative Data-flow Analysis, Revisited
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, for a broad class of problems, it terminates and produces correct results. The theory also establishes a set of conditions where the algorithm runs in at most d(G) + 3 passes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry and Physics
سال: 2017
ISSN: 0393-0440
DOI: 10.1016/j.geomphys.2017.04.014